Complexity of PL manifolds

نویسنده

  • BRUNO MARTELLI
چکیده

We extend Matveev’s complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes under the most common topological operations (handle additions, finite coverings, drilling and surgery of spheres, products, connected sums) and its relations with some geometric invariants (Gromov norm, spherical volume, volume entropy, systolic constant). Complexity distinguishes some homotopically equivalent manifolds and is positive on all closed aspherical manifolds (in particular, on manifolds with non-positive sectional curvature). There are finitely many closed hyperbolic manifolds of any given complexity. On the other hand, there are many closed 4-manifolds of complexity zero (manifolds without 3-handles, doubles of 2handlebodies, infinitely many exotic K3 surfaces, symplectic manifolds with arbitrary fundamental group).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cataloguing PL 4-Manifolds by Gem-Complexity

We describe an algorithm to subdivide automatically a given set of PL nmanifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case n = 4, succeeds to solve completely the PL-homeomorphism problem among the catalogue of all closed connected PL 4-manifolds up to gem-complexity 8 (i.e., which...

متن کامل

Catalogues of PL-manifolds and complexity estimations via crystallization theory

Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbitrary dimension, with or without boundary, which makes use of a particular class of edge-coloured graphs, which are dual to coloured (pseudo-) triangulations. These graphs are usually called gems, i.e. Graphs Encoding Manifolds, or crystallizations if the associated triangulation has the minimal ...

متن کامل

Complexity of 4-Manifolds

A natural notion of complexity of a PL n-dimensional manifold is the minimal number of highest-dimensional simplices in a triangulation of the manifold. Such a complexity is an integer-valued function and is finite (for each k ≥ 0 there are only finitely many manifolds whose complexity is less than or equal to k). In order to find all the n-manifolds of complexity k, one has to identify all the...

متن کامل

On locally convex PL-manifolds and fast verification of convexity

We show that a PL-realization of a closed connected manifold of dimension n − 1 in R (n ≥ 3) is the boundary of a convex polyhedron if and only if the interior of each (n− 3)-face has a point, which has a neighborhood lying on the boundary of a convex n-dimensional body. This result is derived from a generalization of Van Heijenoort’s theorem on locally convex manifolds to the spherical case. O...

متن کامل

Metric Ricci curvature for $PL$ manifolds

We introduce a metric notion of Ricci curvature for PL manifolds and study its convergence properties. We also prove a fitting version of the Bonnet-Myers Theorem, for surfaces as well as for a large class of higher dimensional manifolds.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009